Positive computing

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The first positive: computing positive predictive value at the extremes.

Computing the positive predictive value (PPV) of a wellknown test for a relatively common disease is a straight-forward exercise. However, in the case of a new test for a rare disorder; the extreme numbers involved-the very low prevalence of the disorder and the lack of previous false-positive results--make it difficult to compute the PPV. As new genetic tests become available in the next decad...

متن کامل

Computing Positive Semidefinite Minimum Rank for Small Graphs

Abstract. The positive semidefinite minimum rank of a simple graph G is defined to be the smallest possible rank over all 1 positive semidefinite real symmetric matrices whose ijth entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero 2 otherwise. The computation of this parameter directly is difficult. However, there are a number of known bounding parameters 3 and technique...

متن کامل

Computing Invariants of Reductive Groups in Positive Characteristic

This paper gives an algorithm for computing invariant rings of reductive groups in arbitrary characteristic. Previously, only algorithms for linearly reductive groups and for finite groups have been known. The key step is to find a separating set of invariants.

متن کامل

Computing Hulls, Centerpoints, and VC-Dimension in Positive Definite Space∗

Many data analysis problems in machine learning, shape analysis, information theory and even mechanicalengineering involve the study and analysis of collections of positive definite matrices. The space of such matricesP(n) is a Riemannian manifold with variable negative curvature. It includes Euclidean space and hyperbolic spaceas submanifolds, and poses significant challenges f...

متن کامل

Computing totally positive algebraic integers of small trace

We construct minimal polynomials of totally positive algebraic integers of small absolute trace by consideration of their reductions modulo auxiliary polynomials. Many new examples of such polynomials of minimal absolute trace (for given degree) are found. The computations are pushed to degrees that previously were unattainable, and one consequence is that the new examples form the majority of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Datenschutz und Datensicherheit - DuD

سال: 2016

ISSN: 1614-0702,1862-2607

DOI: 10.1007/s11623-016-0576-z